LPSP: A Linear Plan-level Stochastic Planner
نویسندگان
چکیده
We describe LPSP, a domain-independent planning algorithm that searches the space of linear plans using stochastic local search techniques. Because linear plans, rather than propositional assignments, comprise the states of LPSP’s search space, we can incorporate into its search various operators that are suitable for manipulating plans, such as plan-step reordering based on action dependencies, and limited forward/backward search. This, in turn, leads to a flexible planning algorithm that outperforms the SATPLAN planner on difficult blocks world problems.
منابع مشابه
To Encode or Not to Encode - Linear Planning
Stochastic local search (SLS) techniques are very effective in solving hard propositional satisfiability problems. This has lead to the popularity of the encode & solve paradigm in which different problems are encoded as propositional satisfiability problems to which SLS techniques are applied. In AI, planning is the main area in which this methodology is used. Yet, it seems plausible that SLS ...
متن کاملTo Encode or not to Encode – I: Linear Planning
Stochastic local search (SLS) techniques are very effective in solving hard propositional satisfiability problems. This has lead to the popularity of the encode & solve paradigm in which different problems are encoded as propositional satisfiability problems to which SLS techniques are applied. In AI, planning is the main area in which this methodology is used. Yet, it seems plausible that SLS ...
متن کاملPaper Summary: Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk
This paper presents a model-based planner called the Probabilistic Sulu Planner or the p-Sulu Planner, which controls stochastic systems in a goal directed manner within user-specified risk bounds. The objective of the p-Sulu Planner is to allow users to command continuous, stochastic systems, such as unmanned aerial and space vehicles, in a manner that is both intuitive and safe. To this end, ...
متن کاملProbabilistic Planning for Continuous Dynamic Systems under Bounded Risk
This paper presents a model-based planner called the Probabilistic Sulu Planner or the p-Sulu Planner, which controls stochastic systems in a goal directed manner within user-specified risk bounds. The objective of the p-Sulu Planner is to allow users to command continuous, stochastic systems, such as unmanned aerial and space vehicles, in a manner that is both intuitive and safe. To this end, ...
متن کاملPropositional Probabilistic Planning-as-Satisfiability using Stochastic Local Search
Recent times have seen the development of planners that exploit advances in SAT(isfiability) solving technology to achieve good performance. In that spirit we develop the approximate contingent planner PSLSPLAN. Our approach is based on local search for solving stochastic SAT (SSAT) representations of probabilistic planning problems. PSLSPLAN first constructs an SSAT representation of the ntime...
متن کامل